Small Strategies for Safety Games
نویسنده
چکیده
We consider safety games on finite, edge-labeled graphs and present an algorithm based on automata learning to compute small strategies. Our idea is as follows: we incrementally learn regular sets of winning plays until a winning strategy can be derived. For this purpose we develop a modified version of Kearns and Vazirani’s learning algorithm. Since computing a minimal strategy in this setting is hard (we prove that the corresponding decision problem is NP-complete), our algorithm, which runs in polynomial time, is an interesting and effective heuristic that yields small strategies in our experiments.
منابع مشابه
Sparse Positional Strategies for Safety Games
We consider the problem of obtaining sparse positional strategies for safety games. Such games are a commonly used model in many formal methods, as they make the interaction of a system with its environment explicit. Example applications are the synthesis of finite-state systems from specifications in temporal logic and alternating-time temporal logic (ATL) model checking. Often, a winning stra...
متن کاملNash Equilibrium Strategy for Bi-matrix Games with L-R Fuzzy Payoffs
In this paper, bi-matrix games are investigated based on L-R fuzzy variables. Also, based on the fuzzy max order several models in non-symmetrical L-R fuzzy environment is constructed and the existence condition of Nash equilibrium strategies of the fuzzy bi-matrix games is proposed. At last, based on the Nash equilibrium of crisp parametric bi-matrix games, we obtain the Pareto and weak Pareto...
متن کاملThe Good, The Bad and The Cautious: Safety Level Cooperative Games
We study safety level coalitions in competitive games. Given a normal form game, we define a corresponding cooperative game with transferable utility, where the value of each coalition is determined by the safety level payoff it derives in the original—non-cooperative—game. We thus capture several key features of agents’ behavior: (i) the possible monetary transfer among the coalition members; ...
متن کاملAdmissible Strategies in Timed Games
In this paper, we study the notion of admissibility in timed games. First, we show that admissible strategies may not exist in timed games with a continuous semantics of time, even for safety objectives. Second, we show that the discrete time semantics of timed games is better behaved w.r.t. admissibility: the existence of admissible strategies is guaranteed in that semantics. Third, we provide...
متن کاملThe Multiple Dimensions of Mean-Payoff Games
Outline We consider quantitative game models for the design of reactive systems working in resource-constrained environment. The game is played on a finite weighted graph where some resource (e.g., battery) can be consumed or recharged along the edges of the graph. In mean-payoff games, the resource usage is computed as the long-run average resource consumption. In energy games, the resource us...
متن کامل